Polynomial Complete Consecutive Information Retrieval Problems
نویسندگان
چکیده
منابع مشابه
Memcomputing NP-complete problems in polynomial time using polynomial resources
Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proven mathematically that memcomputing machines have the same computational power of nondeterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using ...
متن کاملPolynomial solvability of $NP$-complete problems
A polynomial algorithm for solving the ”Hamiltonian circuit” problem is presented in the paper. Computational complexity of the algorithm is equal to O ( n log 2 n ) where n is the cardinality of the observed graph vertex set. Thus the polynomial solvability for NP -complete problems is proved.
متن کاملRelational-Complete Private Information Retrieval
We show how relational algebra queries can be processed over relational databases encoded for private information retrieval. In particular, we illustrate how each of the constructs for relational algebra can be compiled into an online stream of private information retrieval requests. This brings relational-complete query capabilities to traditional private information retrieval schemes, which g...
متن کاملImportant problems in information retrieval
Introduction Problem 1. Assisting the user in clarifying and analyzing the problem and determining information needs. Problem 2. Knowing how people use and process information. Problem Assembling a package of information that enables group the user to come closer to a solution of his problem. Includes Problems 3-5.
متن کاملComplete Performance Graphs in Probabilistic Information Retrieval
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system under study: the influence of the irrelevant items is obscured. In this paper, we propose a comprehensive and well normalized description of the ranking performance compared to the performance of an Ideal Retrieval System...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1977
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0206004